Pulsar compilation

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Collaborative Compilation Acwes Collaborative Compilation

Modern optimizing compilers use many heuristic solutions that must be tuned empirically. This tuning is usually done "at the factory" using standard benchmarks. However, applications that are not in the benchmark suite will not achieve the best possible performance, because they are not considered when tuning the compiler. Collaborative compilation alleviates this problem by using local profili...

متن کامل

Reducing Compilation Time by a Compilation Server

In language systems that support separate compilation, we often observe that header files are internalized over and over again when the source files that depend on them are compiled. Making a compiler a long-lived server eliminates such redundant processing of header files, thus reducing the compilation time. The paper first describes compilation servers for C-family languages in general, and t...

متن کامل

Pulsar glitch substructure and pulsar interiors

Pulsar timing at the Mt Pleasant observatory focused on Vela, which could be tracked for 18 hours of the day. These nearly continuous timing records extend over 24 years allowing a great insight into details of timing noise, micro glitches and other more exotic effects. It has been found that the spin up for the Vela pulsar occurs instantaneously to within the uncertainties of the data. The pot...

متن کامل

Pulsar Timing

The motivation for radio pulsar timing and its basic principles are reviewed. Present and future radio timing techniques and hardware are summarised and compared. The array of present timing programmes and their scientific goals are collated and described. Recent results and future prospects are discussed, with emphasis on multi-wavelength techniques where appropriate. Timing of radio pulsars a...

متن کامل

Optimising Compilation

This lecture considers the optimisation of functional programming languages (particularlyìazy' languages) based on`strictness analysis'. Such optimisations alter evaluation order to allow more eecient translation into von Neumann architecture or to increase the parallelism in a sequentially speciied system (such as that implied by lazy-semantics).

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Nature

سال: 1978

ISSN: 0028-0836,1476-4687

DOI: 10.1038/271285a0